A linear time algorithm for the hausdorff distance between convex polygonsATALLAH, M. J.Information processing letters. 1983, Vol 17, Num 4, pp 207-209, issn 0020-0190Article

ProblemsGUIBAS, L. J.Journal of algorithms (Print). 1983, Vol 4, Num 2, pp 176-188, issn 0196-6774Article

A new approach to rectangle intersections. IEDELSBRUNNER, H.International journal of computer mathematics. 1983, Vol 13, Num 3-4, pp 209-219, issn 0020-7160Article

A new approach to rectangle intersections. IIEDELSBRUNNER, H.International journal of computer mathematics. 1983, Vol 13, Num 3-4, pp 221-229, issn 0020-7160Article

A note on the complexicity of a partition algorithmLIFSCHITZ, V; PESOTCHINSKY, L.Information processing letters. 1983, Vol 17, Num 3, pp 117-120, issn 0020-0190Article

Can integers be sorted in linear worst case time?VAN DER NAT, M.Angewandte Informatik. 1983, Vol 25, Num 11, pp 499-501, issn 0013-5704Article

An empirical study of insertion and deletion binary search treesEPPINGER, J. L.Communications of the ACM. 1983, Vol 26, Num 9, pp 663-669, issn 0001-0782Article

The duodirun merging algorithm: a new fast algorithm for parallel mergingZHENG, Z.-J.Information processing letters. 1983, Vol 17, Num 3, pp 167-168, issn 0020-0190Article

On computing all north-east nearest neighbors in the L₁ metricGUIBAS, L. J; STOLFI, J.Information processing letters. 1983, Vol 17, Num 4, pp 219-223, issn 0020-0190Article

Improving the performance guarantee for approximate graph coloringWIGDERSON, A.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 4, pp 729-735, issn 0004-5411Article

Listing and counting subtrees of equal sizeHIKITA, T.Information processing letters. 1983, Vol 17, Num 4, pp 225-229, issn 0020-0190Article

Sorting in c log n parallel stepsAJTAI, M; KOMLOS, J; SZEMEREDI, E et al.Combinatorica (Print). 1983, Vol 3, Num 1, pp 1-19, issn 0209-9683Article

On the time complexities of the simple-path problem and the minimum depth problem for extended reducible flow graphsHIRATA, T.Systems, computers, controls. 1982, Vol 13, Num 4, pp 83-90, issn 0096-8765Article

On the number of relational operators necessary to compute certain functions of real variablesSCHMITT, A.Acta informatica. 1983, Vol 19, Num 3, pp 297-304, issn 0001-5903Article

The bottom-left bin-packing heuristic: an efficient implementationCHAZELLE, B.IEEE transactions on computers. 1983, Vol 32, Num 8, pp 697-707, issn 0018-9340Article

Three-triangle-tangramBRUGNER, G.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 3, pp 380-382, issn 0006-3835Article

Continuous models that are equivalent to randomness for the analysis of many sorting algorithmsDOBERKAT, E. E.Computing (Wien. Print). 1983, Vol 31, Num 1, pp 11-31, issn 0010-485XArticle

Time- and space-optimal height-balanced 2-3 brother treesMURTHY, Y. D; BHATTACHARJEE, G. P; SEETARAMANATH, M. N et al.International journal of computer mathematics. 1983, Vol 13, Num 3-4, pp 171-188, issn 0020-7160Article

A formal account of some elementary continued fraction algorithmsBEYNON, W. M.Journal of algorithms (Print). 1983, Vol 4, Num 3, pp 221-240, issn 0196-6774Article

The random selection of unlabeled graphsDIXON, J. D; WILF, H. S.Journal of algorithms (Print). 1983, Vol 4, Num 3, pp 205-213, issn 0196-6774Article

A discussion of a report by Ehud ShapiroBANERJI, R. B.Computational intelligence. 1987, Vol 3, Num 4, pp 295-303, issn 0824-7935Article

A convex hull algorithm for planar simple polygonsORLOWSKI, M.Pattern recognition. 1985, Vol 18, Num 5, pp 361-366, issn 0031-3203Article

The power of parallel prefixKRUSKAL, C. P; RUDOLPH, L; SNIR, M et al.IEEE transactions on computers. 1985, Vol 34, Num 10, pp 965-968, issn 0018-9340Article

A survey of algorithms for contiguity-constrained clustering and related problemsMURTAGH, F.Computer journal (Print). 1985, Vol 28, Num 1, pp 82-88, issn 0010-4620Article

A partitioning algorithm for minimum weighted Euclidean matchingDYER, M. E; FRIEZE, A. M.Information processing letters. 1984, Vol 18, Num 2, pp 59-62, issn 0020-0190Article